Beck's conjecture and multiplicative lattices
نویسندگان
چکیده
In this paper, we introduce the multiplicative zero-divisor graph of a multiplicative lattice and study Beck-like coloring of such graphs. Further, it is proved that for such graphs, the chromatic number and the clique number need not be equal. On the other hand, if a multiplicative lattice L is reduced, then the chromatic number and the clique number of the multiplicative zero-divisor graph of L are equal, which extends the result of Behboodi and Rakeei (2011) and Aalipour et al. (2012). © 2014 Elsevier B.V. All rights reserved.
منابع مشابه
Frankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملWiener Way to Dimensionality
This note introduces a new general conjecture correlating the dimensionality dT of an infinite lattice with N nodes to the asymptotic value of its Wiener Index W(N). In the limit of large N the general asymptotic behavior W(N)≈Ns is proposed, where the exponent s and dT are related by the conjectured formula s=2+1/dT allowing a new definition of dimensionality dW=(s-2)-1. Being related to the t...
متن کاملLattices arising in categorial investigations of Hedetniemi's conjecture
We discuss Hedetniemi's conjecture in the context of categories of relational structures under homomorphisms. In this language Hedetniemi's conjecture says that if there are no homomor-phisms from the graphs G and H to the complete graph on n vertices then there is no homomorphism from G x H to the complete graph. If an object in some category has just this property then it is called multiplica...
متن کاملMultiple Cover
Motivated by applications in Markov estimation and distributed computing, we deene the blanket time of an undirected graph G to be the expected time for a random walk to hit every vertex of G within a constant factor of the number of times predicted by the stationary distribution. Thus the blanket time is, essentially, the number of steps required of a random walk in order that the observed dis...
متن کاملStable Lattices and the Diagonal Group
Inspired by work of McMullen, we show that any orbit of the diagonal group in the space of lattices accumulates on the set of stable lattices. As consequences, we settle a conjecture of Ramharter concerning the asymptotic behavior of the Mordell constant, and reduce Minkowski’s conjecture on products of linear forms to a geometric question, yielding two new proofs of the conjecture in dimension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 338 شماره
صفحات -
تاریخ انتشار 2015